package algorithm;

import java.util.Arrays;

public class Test1 {
    public static void main(String[] args) {
        // 冒泡排序
        int[] arr = {5, 2, 3, 1};
        for (int i = 0; i < arr.length - 1; i++) {
            // i = 0, 1, 2          [5, 2, 3, 1]           次数
            // i = 0                 0  1  2                3
            // i = 1                 0  1                   2
            // i = 2                 0                      1
            for (int j = 0; j < arr.length - i - 1; j++) {
                if(arr[j] > arr[j + 1]){
                    int temp = arr[j + 1];
                    arr[j + 1] = arr[j];
                    arr[j] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}
